Some remarks on cardinal arithmetic without choice

نویسندگان

  • Supakun Panasawatwong
  • Pimpen Vejjajiva
چکیده

One important consequence of the Axiom of Choice is the absorption law of cardinal arithmetic. It states that for any cardinals m and n, if m 6 n and n is infinite, then m+ n = n and if m 6= 0, m · n = n. In this paper, we investigate some conditions that make this property hold as well as an instance when such a property cannot be proved in the absence of the Axiom of Choice. We further find some conditions that preserve orderings in cardinal arithmetic. These results also lead to the conditions that make the cancellation law of cardinal arithmetic hold in set theory without choice.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some remarks on the arithmetic-geometric index

Using an identity for effective resistances, we find a relationship between the arithmetic-geometric index and the global ciclicity index. Also, with the help of majorization, we find tight upper and lower bounds for the arithmetic-geometric index.

متن کامل

Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of Choice

Fairly deep results of Zermelo-Frænkel (ZF) set theory have been mechanized using the proof assistant Isabelle. The results concern cardinal arithmetic and the Axiom of Choice (AC). A key result about cardinal multiplication is κ⊗ κ = κ, where κ is any infinite cardinal. Proving this result required developing theories of orders, order-isomorphisms, order types, ordinal arithmetic, cardinals, e...

متن کامل

Ultrafilters and Large Cardinals

This paper is a survey of basic large cardinal notions, and applications of large cardinal ultrafilters in forcing. The main application presented is the consistent failure of the singular cardinals hypothesis. Other applications are mentioned that involve variants of Prikry forcing, over models of choice and models of determinacy. My talk at the Ultramath conference was about ultrafilters and ...

متن کامل

Erdos-Rado without choice

A version of the Erdös-Rado theorem on partitions of the unordered ntuples from uncountable sets is proved, without using the axiom of choice. The case with exponent 1 is just the Sierpinski-Hartogs’ result that א(α) ≤ 2 2α . The liberal use made by Erdös and Rado in [2] of the cardinal arithmetic versions of the axiom of choice enables them to give their result a particularly simple expression...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013